Synchronizing shared resources in an order processing environment using a synchronization component

ABSTRACT

An order processing system can include an order processing container, a factory registry, a relationship registry, and synchronization function component. The order processing system can handle orders, which are build plans including a set of tasks. The tasks can specify programmatic actions which may include creation, deletion, and modification of resources and resource topologies. The order processing container can be central engine that programmatically drives order processing actions. The factory registry can support a creation and deletion of resource instances in a resource topology defined by at least one order. The relationship registry can maintain relationships among resources. The synchronization function component can permit transparent usage of shared resources in accordance with shared usage resource topology parameters specified within processed orders.

BACKGROUND OF THE INVENTION

The present invention relates to the field of shared resource handlingin a service environment, synchronizing shared resources in an orderprocessing environment using a synchronization component.

It can be beneficial to be able to perform systems management for flowsin a scope of an entire IT service environment. FIG. 1 (prior art)represents a system 100 for a resource topology that permits systemmanagement flows to be created and used. Additional details relating tothe structure and implementation specifics of system 100 are disclosedin the cross referenced application entitled “Method and System forDynamically Creating and Modifying Resource Topologies and ExecutingSystems Management Flows.” Discussions presented herein are asimplification of that topology for purposes of explaining the solutiondisclosed herein. The system 100 utilizes three abstraction layersincluding a system management flows layer 120, a system management layer130, and an IT resources layer 140.

The flows layer 120 can interact with a systems management layer 130,which includes many different resource managers 132-138. These resourcemanagers 132-138 can perform programmatic functions relating toresources of layer 140. These functions can control options of aresource, such as provisioning resources, de-provisioning resources, andotherwise controlling an operation and configuration of a series ofresources. Managers 132-138 can include, but are not limited to, networkdevice manager(s) 132, cluster manager(s) 134, storage device manager(s)135, application manager(s) 136, server manager(s) 137, software imagemanager(s) 138, and the like. Using system management layer 130 changescan be made relating to the IT resources of layer 140 in a mannertransparent to flows layer 120.

The IT resources layer 140 can include a set of computing resources142-148, which perform computing functions. These resources 140 can bedistributed across a network and can conform to numerous differentplatform specific and/or resource specific standards. Low-levelstandards of the resources 142-148 can be locally handled, such as by anoperating system. The resources 142-148 can conform to numerousstandards, which permits the systems manager(s) 132-138 to performresource functions in a unified manner. For example, each of theresources 142-148 can include an interface and a set of publishedmethods for interacting with the resource 142-148 through the interface.Resources, such as SOA system resources 147 and/or Enterprise ResourcePlanning (ERP) resources 148 can represent a supersets of componentresources, which is able to be controlled and managed through astandardized interface and set of programmatic calls. An actualcomplexity of each resource 142-148 is arbitrary and each can be managedand controlled by one or more managers 132-138. The resources 142-148can include, but are not limited to application resource(s) 142, storagedevice resource(s) 144, Web 2.0 system resource(s) 145, DB managementsystem resource(s) 146, SOA system resource(s) 147, Enterprise ResourcePlanning (ERP) system resources, and the like.

The system management flows layer 120 can handle various flows 122-126at a flow level. In one embodiment, each flow 122-126 can be associatedwith a flow order, which includes a number of discrete tasks (e.g.,Tasks A, B, C, . . . N) that are to be conducted. On or more workflowengines 128 of layer 120 can ensure that each task is performed inaccordance with tasks specifics. That is, from a management perspective,interactions for flows 122-126 can occur at a flow level by interactingwith engines 128. In system 100, it is advantageous to maintain layer130 as a layer of abstraction between layer 120 and layer 140, since itpermits consistent handling of tasks in a resource 142-148 independentmanner. Actual resources 142-148 utilized to handle discrete tasks anddetails therein can vary to an arbitrary extent, without affectingoperations of work flow engine 128.

One heretofore unresolved challenge with system 100 relates to theconcurrent handling of shared resources 142-148. That is, IT resources142-148 may be concurrently used by two or more flows 122-126 executingin parallel. Present designs of system 100, therefore, often place aresource synchronization burden on a flow 122-126 designer. A designerof a flow 122-126 can therefore not just concentrate on applicationaspects of the flow, which is one significant benefit of system 100 overtraditional work flow implementations. Further, an error in criticalsections of flow 122-126 code can influence concurrent flows waiting toaccess a shared resource (through manager 132-138 exposed functions).

BRIEF SUMMARY OF THE INVENTION

An order processing system that includes an order processing container,a factory registry, a relationship registry, and a synchronizationfunction. The order processing container can be a central engine thatprogrammatically drives order processing actions for a set of discreteorders. The order processing actions can be programmatic actionsperformed responsive to an order. An order can be a build plan includinga series of tasks. Tasks can specify programmatic actions which mayinclude creation, deletion, and modification of resources and resourcetopologies. The factory registry can support a creation and deletion ofresource instances in a resource topology defined by at least one order.The relationship registry can maintain relationships among resourceinstances of resource topologies defined by at least one order. Thesynchronization function component can permit transparent usage ofshared resources in accordance with shared usage resource topologyparameters specified within processed orders. The synchronizationfunction component can support concurrent processing of orders inaccordance with the shared usage resource topology parameters.

The order processing container, the factory registry, the relationshipregistry, and the synchronization function can be configured to processat least three different type of orders. These order types can includeinitial orders, modification orders, and termination orders. Initialorders can contain tasks for building up an initial resource topology.Modification orders are processed on resource topologies that have beeninitialized by an initial order and may result in a change to theresource topology. Termination orders terminate all management actionsrelating to a resource topology, which can result in a deconstruction ofthe resource topology.

In one embodiment, the synchronization function component can beconfigured to support at least one standardized resource topology actionrelated to shared resources. Standardized resource topology actions caninclude a bindOrcreate action and an unbindOrdelete action. AbindOrcreate action can be a programmatic action that defines aconnection of a flow specific resource identifier with a sharedresource. The unbindOrdelete action can be a programmatic action thatdisconnects a flow specific resource identifier with the sharedresource.

In one embodiment, the synchronization function component can beconfigured to utilize a synchronization scope value, which affectswhether shared resources permit orders to be concurrently processed.Configurable values for the synchronization scope can include: All,BindAndUnbind, and None. The synchronization function component canensure that orders processed on shared resources are synchronized andexclusive access to the shared resource is provided to each order when asynchronization scope value is set to All. When a synchronization scopevalue is set to BindAndUnbind, the synchronization function componentcan ensure that orders processed on a shared resources are synchronizedand exclusive access is only guaranteed for orders that create or deletea relationship of the shared resource—other orders can be permitted tobe concurrently executed by the shared resource.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS

FIG. 1 (prior art) represents a system for a resource topology thatpermits system management flows to be created and used.

FIG. 2 is a schematic diagram of an information technology serviceenvironment which includes a synchronization component for handlingorders in accordance with an embodiment of the inventive arrangementsdisclosed herein.

FIG. 3 is a schematic diagram of an order processing environment thatincludes a synchronization function component in accordance with anembodiment of the inventive arrangements disclosed herein.

DETAILED DESCRIPTION OF THE INVENTION

The present invention extends an order processing environment (i.e., aninformation technology service environment capable of handling systemmanagement flows, which can each include a set of tasks implemented in aresource abstracted fashion) to include a synchronization functioncomponent. This component is designed to interact with other keycomponents of the order processing environment, such as an orderprocessing container, a factory registry, and a relationship registry.The order document within a system management flow can specify detailsof a sequence of tasks needed for that order and any dependency issuesrelating to ordering and processing of these tasks. The synchronizationfunction component can process the order document details and performprogrammatic actions, dynamically derived from the resource model,needed to synchronize the tasks relative to each other. Thus, flows andflow tasks can be synchronized without reliance on flow level code.

The present invention may be embodied as a method, system, or computerprogram product. Accordingly, the present invention may take the form ofan entirely hardware embodiment, an entirely software embodiment(including firmware, resident software, micro-code, etc.) or anembodiment combining software and hardware aspects that may allgenerally be referred to herein as a “circuit,” “module” or “system.”Furthermore, the present invention may take the form of a computerprogram product on a computer-usable storage medium havingcomputer-usable program code embodied in the medium. In a preferredembodiment, the invention is implemented in software, which includes butis not limited to firmware, resident software, microcode, etc.

Furthermore, the invention can take the form of a computer programproduct accessible from a computer-usable or computer-readable mediumproviding program code for use by or in connection with a computer orany instruction execution system. For the purposes of this description,a computer-usable or computer readable medium can be any apparatus thatcan contain, store, communicate, propagate, or transport the program foruse by or in connection with the instruction execution system,apparatus, or device. The computer-usable medium may include apropagated data signal with the computer-usable program code embodiedtherewith, either in baseband or as part of a carrier wave. The computerusable program code may be transmitted using any appropriate medium,including, but not limited to the Internet, wireline, optical fibercable, RF, etc.

Any suitable computer usable or computer readable medium may beutilized. The computer-usable or computer-readable medium may be, forexample but not limited to, an electronic, magnetic, optical,electromagnetic, infrared, or semiconductor system, apparatus, device,or propagation medium. Examples of a computer-readable medium include asemiconductor or solid state memory, magnetic tape, a removable computerdiskette, a random access memory (RAM), a read-only memory (ROM), anerasable programmable read-only memory (EPROM or Flash memory, a rigidmagnetic disk and an optical disk. Current examples of optical disksinclude compact disk-read only memory (CD-ROM), compact disk-read/write(CD-R/W) and DVD. Other computer-readable medium can include atransmission media, such as those supporting the Internet, an intranet,a personal area network (PAN), or a magnetic storage device.Transmission media can include an electrical connection having one ormore wires, an optical fiber, an optical storage device, and a definedsegment of the electromagnet spectrum through which digitally encodedcontent is wirelessly conveyed using a carrier wave.

Note that the computer-usable or computer-readable medium can eveninclude paper or another suitable medium upon which the program isprinted, as the program can be electronically captured, for instance,via optical scanning of the paper or other medium, then compiled,interpreted, or otherwise processed in a suitable manner, if necessary,and then stored in a computer memory.

Computer program code for carrying out operations of the presentinvention may be written in an object oriented programming language suchas Java, Smalltalk, C++ or the like. However, the computer program codefor carrying out operations of the present invention may also be writtenin conventional procedural programming languages, such as the “C”programming language or similar programming languages. The program codemay execute entirely on the user's computer, partly on the user'scomputer, as a stand-alone software package, partly on the user'scomputer and partly on a remote computer or entirely on the remotecomputer or server. In the latter scenario, the remote computer may beconnected to the user's computer through a local area network (LAN) or awide area network (WAN), or the connection may be made to an externalcomputer (for example, through the Internet using an Internet ServiceProvider).

A data processing system suitable for storing and/or executing programcode will include at least one processor coupled directly or indirectlyto memory elements through a system bus. The memory elements can includelocal memory employed during actual execution of the program code, bulkstorage, and cache memories which provide temporary storage of at leastsome program code in order to reduce the number of times code must beretrieved from bulk storage during execution.

Input/output or I/O devices (including but not limited to keyboards,displays, pointing devices, etc.) can be coupled to the system eitherdirectly or through intervening I/O controllers.

Network adapters may also be coupled to the system to enable the dataprocessing system to become coupled to other data processing systems orremote printers or storage devices through intervening private or publicnetworks. Modems, cable modem and Ethernet cards are just a few of thecurrently available types of network adapters.

The present invention is described below with reference to flowchartillustrations and/or block diagrams of methods, apparatus (systems), andcomputer program products according to embodiments of the invention. Itwill be understood that each block of the flowchart illustrations and/orblock diagrams, and combinations of blocks in the flowchartillustrations and/or block diagrams, can be implemented by computerprogram instructions. These computer program instructions may beprovided to a processor of a general purpose computer, special purposecomputer, or other programmable data processing apparatus to produce amachine, such that the instructions, which execute via the processor ofthe computer or other programmable data processing apparatus, createmeans for implementing the functions/acts specified in the flowchartand/or block diagram block or blocks.

These computer program instructions may also be stored in acomputer-readable memory that can direct a computer or otherprogrammable data processing apparatus to function in a particularmanner, such that the instructions stored in the computer-readablememory produce an article of manufacture including instruction meanswhich implement the function/act specified in the flowchart and/or blockdiagram block or blocks.

The computer program instructions may also be loaded onto a computer orother programmable data processing apparatus to cause a series ofoperational steps to be performed on the computer or other programmableapparatus to produce a computer implemented process such that theinstructions which execute on the computer or other programmableapparatus provide steps for implementing the functions/acts specified inthe flowchart and/or block diagram block or blocks.

FIG. 2 is a schematic diagram of an information technology serviceenvironment which includes a synchronization function component 258 forhandling orders 210 in accordance with an embodiment of the inventivearrangements disclosed herein. The order processing environment 220 isable to currently process multiple orders 210 using one or more workflow engines. Each order 210 can include an order document 214 and aflow 212. The flow 212 can be a sequence of discrete tasks that are tobe performed. Tasks are handled by a resource manager 230, whichacquires and manages the necessary resources 240. The synchronizationfunction component 258 can perform synchronization functions for theworkflow engine(s) of the order processing environment 220. Because ofcomponent 258, explicit synchronization handling does not have to bedefined in the definitions and/or code of the workflows 212.

The order 210 can be considered a build plan, which includes therequired parameters and topology actions for the involved resources 240of a work flow 212. The work flow engines inspect each order 210 andderive a set of actions for achieving an overall programmatic goal,thereby causing workflows 212 to be executed. Execution of orders 210can be handled within an order processing environment, which can beabstracted from an actual set of resources 240 that perform programmaticactions. That is, the work flow engine can exchange data through aninterface 232 with one or more resource managers 230. The managers 230can exchange data through an interface 242 with one or more resources240.

As used herein, a flow 212 is a series of steps (herein called tasks),which are required to complete a transaction. In one embodiment, a flow212 can be a business process based upon one or more Web services. Thatis flow 212 can utilize a set of Web service interfaces to import andexport functionality. Flows 212 can be defined using standardizedsoftware languages, such as the Web Services Business Process ExecutionLanguage (WS-BPEL), which is an Organization for the Advancement ofStructured Information Standards (OASIS) standard.

WS-BPEL is just one language for programmatically specifying flows 212and the invention is not to be construed as limited in this regard. Forexample, flows 212 can be specified using a Business Process ModelingNotation (BPMN), a Web Services Conversation Language (WS-CDL), XMLProcess Definition Language, a Service-Oriented Modeling Framework(SOMF) language, a Web Services Flow Language (WSFL), XLANG or otherextension of Web Services Description Language, and the like.

Generally, a flow 212 is an artifact resulting from “programming in thelarge” which requires building abstractions, which are able to for anarchitecture unlikely to be often changed. That is, flows 212 canrepresent a set of publicly observable behaviors represented in astandardized fashion. In this case, the flow 212 represents anabstracted IT computing environment consisting that utilizes a pluralityof non-abstracted IT resources 240. That is, a flow 212 can allocate,de-allocate, and otherwise configure the set of system managementresources in the abstracted IT environment. Programming in the large canbe contrasted with programming in the small, which deals withshort-lived programmatic behavior, often executed as a singletransaction and involving access to local logic and resources, such asfiles, databases, etc. Resources 240 leveraged by the flows 212 aregenerally “programmed in the small”.

The order processing environment 220 can be any environment able toexecute the flow 212. In a WS-BPEL based environment, where Web servicesare utilized as interfaces to import and export functionality, theenvironment 220 can be a Web service environment. Environment 220 caninclude, but is not limited to, a service oriented architecture (SOA)environment, a Web Service Execution Environment (WSMX), a Semantic Webservices (SWSs) environment, Open Grid Services Infrastructure WorkingGroup (OGSI WG) based environment, and the like. The order processingenvironment 220 can utilize standardized technologies to facilitate dataexchange, such as Service Oriented Architecture Protocol (SOAP),Universal Description, Discovery and Integration (UDDI), Web ServiceDescription Language (WSDL), Common Object Request Broker Architecture(CORBA), .NET technologies, etc.

Environment 220 includes order processing container 252, relationshipregistry 254, factory registry 256, and synchronization functioncomponent 258. Each component of environment 250 can be associated witha component specific data store 260-268, which can be a persistentmemory store able to store digitally encoded data. The components250-258 create, destroy, and utilize resources 240.

The order processing container 252 is a central engine or node of theenvironment 220 that drives order 212 processing actions. The factoryregistry 254 supports the creation and deletion of new resourceinstances. The relationship registry 256 stores and maintainsrelationships between resources. The synchronization component 258implements a synchronization mechanism which restricts/enables parallelprocessing of orders 212 based upon order specific information 214.

An order 210 can be defined as a software artifact (e.g., an XMLdocument for example) that defines a number of tasks (flow 212) andinformation 214 concerning a handling of these tasks and/or the flow 212in general. Stated differently, an order 210 can be considered a buildplan, which incorporates the required parameters and topology actionsfor the involved resources 240.

Three types of orders 210 can exist in system 200, which include initialorders, modification orders, and termination orders. Initial orders cancontain tasks for building up an initial resource topology. Modificationorders can be processed on resource topologies that have beeninitialized by an initial order. A termination order can be a last orderthat can be applied to a resource topology, which terminates allmanagement actions relating to the resource topology and then disposingof the topology.

Orders 210 are “passed” along the resources 240. In one embodiment, this“passing” can be sequential, where the order 210 is effectively a tokenpassed among a set of resources 240 causing each “token” possessingresource to perform programmatic actions defined within the order 210.Each resource 240 inspects the order 210, and derives its actions forachieving the overall goal. If the processing container 252 has passedthe order 210 to all resources 240, the so-called request path isterminated, and the response path is entered. In the response path, theprocessing container 252 queries its internal stack for traversingthrough all resources 240 the processing container 252 has called beforein reverse order.

State for the flow 212 is maintained within an order 210. As shown insample order 270, each order can store information, such as an ordername 272, an order type 273, and can include a number of informationsections 274. Each section 274 can include resource specific data forresources 240 of the flow 212. Sections 274 can include a subscriptionsection 275, an OSD section 276, an application section 277, andapplication tier section 278, a meter event log section 279, a Webapplication section 280, a report manager section 281, a cluster section282, and the like. Specifics of these sections are elaborated upon morefully in cross referenced application entitled “Method and System forDynamically Creating and Modifying Resource Topologies and ExecutingSystems Management Flows” incorporated by reference herein.

Each section 274 can include input parameters 284 and topologyparameters 286 that describes a set of relationships and resources thatare to be created, deleted, and otherwise utilized when processing flow212 tasks. The topology parameters 284 can include information used bythe synchronization function component 258, 258 to ensure resource 240are properly synchronized.

The relationship registry 256 stores relationships between resources,which includes relationships relevant to synchronization. In oneembodiment, each relation stored in the registry 256 can have multipleattributes. These attributes can include, for example, a sourceHandle(pointer to a first resource in a relation), a targetHandle (pointer toa second resource in a relation), a sourceRole (role of the firstresource), a targetRole (role of the second resource), and an optionalrelationName. Roles can include a role for an order handler component(H) and a role for an order processing component (P). Valid combinationsof (sourceRole, targetRole) can include (P,P), (P,H), and (H,H), wherethe combination of (H,P) is invalid.

Two topology actions performed by synchronization function component 258involving an order 210 can include a bindOrcreate action 255 and anunbindOrDelete action 257. These actions 255, 257 relate to sharedresources, which are resources 240 shared between two or more orders 210or used by two or more flows 212 of different IT Service Environments.

The topology action bindOrCreate 255 defines a connection of a resourceX to the shared resource with specific properties (stored as topologyparameters 286 as a shared resource relationship 287). If a sharedresource cannot be found, then a new instance of the shared resource canbe created. When a new relation with the reserved relation name “isRepresentedBy” is created that connects the resource X with the sharedresource.

The topology action unbindorDelete 257 removes a connection betweenresource X and the related target shared resource with specificproperties, which can be defined by a query in the topology actiondefinition (stored in parameters 286). Isolated shared resources with noconnection to other resources are automatically deleted (bysynchronization function component 258).

In one embodiment, a definition associated with a shared resource can beextended to include a synchronization scope 288. Values forsynchronization scope 288 can include All, BindAndUnbind, and None.

The synchronization scope 288 value All can define default behavior,which is used when no scope definition is present. When scope 288 is setto All, orders 212 processed on the shared resource are synchronized andexclusive access to the Shared Resource is provided for each order 212.Hence, at each time only one order 210 can be processed on the sharedresource.

The synchronization scope 288 value BindAndUnbind, exclusive access isonly guaranteed for orders 210 that actually create or delete arelationship to the shared resource. Hence, more than one order 210 canbe processed at a time, but only if all of these orders 210 require anone-exclusive access. The rational behind the BindAndUnbind scope valueis twofold. First, the throughput in the order 210 processing ofenvironment 220 is increased by allowing more than one order 210 to beprocessed at a time. Second, all orders 210 that actually modify theresource topology are isolated against each other. This guarantees thatan order 210 being processed on a shared resource and the correspondingsubtree works on the same resource topology for the time of its order210 processing because no topology changes of other orders 210 areallowed.

The synchronization scope 288 value None specifies that no order 210synchronization is required at all. This scope value may be used forshared resources where the parallel execution of orders is not critical,or where other precautions (e.g. own synchronization logic in the taskimplementation working on the shared resource) are made to avoidproblems when running orders 210 in parallel.

In one embodiment, synchronization scope can be defined at both an order210 and at a resource 240 (shown as scope 237) level. The resource levelscope 237 can be a default value for a given resource. The order 212defined scope 288 can overrule the “global” synchronization scope 236defined for a shared resource. This overruling can be limited tosituations when the value of scope 237 is set to All. That is, orders210 may weaken the global scope for its own order processing to none(which means that this order 212 can be processed on the Shared Resourcetogether with other orders 212 requiring also only none-exclusiveaccess). Also, orders 212 may be specified as friends to other orders212, which enables the container 252 to process those orders 210concurrently.

FIG. 3 is a schematic diagram 300 of an order processing environmentthat includes a synchronization function component 320 in accordancewith an embodiment of the inventive arrangements disclosed herein. Theprocesses and flows of diagram 300 can be implemented in context ofsystem 200.

In diagram 300, a systems management flow layer 302 communicates to asystems management layer 304, which communicates to an IT resource layer306. An order processing environment 312 resides and operates at thesystems management flows layer 302. The order processing environment 213can include an order processing container 314, a factory registry 316, arelationship registry 318, and a synchronization function component 320.Specifics for components 312-318 are elaborated upon more fully in crossreferenced application entitled “Method and System for DynamicallyCreating and Modifying Resource Topologies and Executing SystemsManagement Flows” incorporated by reference herein.

The synchronization function component 320 can include synchronizationlogic 322, a resource topology navigator and modifier 326, and an orderdocument parser 324. The synchronization function component 320 can becalled for life cycle support of shared resources as well as forsynchronizing orders being processed on shared resources.

For life cycle support, the synchronization function component (SFC) 320can be called by the container 314 in a request path if a resourcetopology section (e.g., sections 274) is included for the Vresource tobe called next. The order document and the Resource Handle (pointer to aresource) of the resource can be provided as arguments by the container314 to the SFC 320.

The synchronization logic 322 of the SFC 320 can initialize a statefulsynchronization operation for determining whether the resource topologysections contains the topology action bindOrCreate. The order documentparser 324 can be used to find the appropriate topology definition inthe order document. If defined, the SFC 322 will use its resourcetopology modificator 326 which in turn interacts with the relationshipregistry 318 and the factory registry 316 to create a new sharedresources instance (if not already present) and a new relationship(named ‘is RepresentedBy’) between the resource specified by theprovided Resource Handle and the shared resource. If a new instance of ashared resource is created, the SFC 320 can also create the controlstructures required for the synchronization of orders being processed onthe shared resource. Finally, control is given from component 320 to thecontainer 314.

In one embodiment, the complete life cycle of shared resources can bemaintained by the SFC 320. The SFC 320 can create shared resource aswell as all relationships referencing shared resources, as defined inthe Topology section of the order document. It can also deletes existingrelationships from resources to a shared resource if specified in thetopology section of the order document. If the last relationship to theshared resource is deleted, the shared resource is destroyed as well andits corresponding control structures are cleaned up. During thelifecycle of a shared resource, the SFC 320 manages the ordersynchronization on it, using the information stored in the relationshipregistry 318 and its own internal control structures.

In one embodiment, the SFC 320 can be called by the container both inthe Request and Response Path for synchronization support. In theRequest Path, the SFC 320 is called by the container 314 during theorder processing before the order document is delegated to the nextresource. The order document, and the Resource Handle of the resourcethat is to be called next are provided as arguments by the container 314to the SFC 320. The synchronization logic 322 of the SFC 320 uses itsresource topology navigator 326 which in turn interacts with therelationship registry 318 to check whether the resource specified by theResource Handle is related to a shared resource. If no relation exists,the SFC 320 can finish processes and can transfer control back to thecontainer 314.

If a relation exists, the SFC 320 can initialize a statefulsynchronization operation for synchronizing this order against potentialorders already running at this time. For this purpose SFC 320 can useits internal control structures that store the list of processing andwaiting orders on the shared resource. When the list of processingorders is empty, the current order can be allowed to be processedimmediately. Otherwise, the current order can be added to the list ofwaiting orders for later processing. Once the decision is made and theinternal control structures are updated accordingly the SFC 320 cantransfer control to container 314. When the order has been queued forwaiting by the SFC 320, programmatic logic of the container 314 canelect to not delegate the order to the next resource.

In the Response Path, the SFC 320 can be called by the container 314during the order processing after the order document was conveyed to thecontainer 314 by a resource. The order document, and the Resource Handleof the component that has just finished its order processing can beprovided as arguments by the container 314 to the SFC 320. Thesynchronization logic 322 can use resource topology navigator 326 whichin turn interacts with the relationship registry 318 to check whetherthe resource specified by the Resource Handle is related to a SharedResource. If no relation exists the SFC 320 can finish processing andcan transfer control to the container 314.

If a relation exists, the SFC 320 can initialize a statefulsynchronization operation for synchronizing this order against potentialorders that are already running. The SFC 320 can uses its internalcontrol structures that stores the list of processing and waiting Orderson the Shared Resource when performing the synchronization operation.The SFC 320 can removes the order from the list of processing orderswhen the order processing on the shared resource and the correspondingsubtree has finished. The list of waiting orders can be used to identifyorders that are currently waiting to be processed on the sharedresource. If available, the first order in the list can be identifiedand provided to the container 314 for further processing. The internalcontrol structures are updated accordingly. If the first order requiresonly non-exclusive access on the shared resource, then the SFC alsoinspects the following orders in the list of waiting orders and alsoprovides all further orders requiring non-exclusive access to thecontainer 314 for processing. In this manner, one or more waiting ordersare activated for further processing.

Example 330 shows a resource topology for two different orders 340 and350. Order 340, 350 can subscribe 342, 352 to a set of resources.Subscriptions 342, 352 can each represent a subscription for a service,such as a Web service. The subscriptions can use resources of a set ofservers 344, 354. These servers 344, 354 can include an operating systemcontainer 345, 354 containing an operating system 347, 357. Theoperating system containers 345, 354 provide flexibility of handlingsituations with virtual operating systems, operating systems executingon virtual machines, distributed operating systems, and the like.Database Management System (DBMS) Software 348, 358 can execute on theoperating systems 347, 357.

In one embodiment, each order 340, 350 can include a business flow forproviding in-house IT services for two different departments. Each order340-350 can be hosted/consist of a different set of IT resources, mainlythe collection of servers 344, 354 used and the software stack installedon each of the servers 344, 354 (e.g., operating system 347, 357 andapplication software 348, 358). The flows within the orders 340, 350 canprovide services to provision new application servers for an ERP system.

Both orders 340, 250 share a common set of resources, namely theOSContainer 345, 355 (server), the OS 347, 357 (operating system) andthe DBMS Software 348, 358. Shared resources can be established foreach, shown by OS container shared resource 365, OS shared resource 367,and DBMS software shared resource 368.

Although the orders 340, 350 manage different ERP systems, both can beallowed to use the same physical server box to provision the DBMSserver. If the operating system and the base database management systemsoftware is already installed on that server, the System Management Flowwill leave this installation untouched and perform only the necessarysteps to create an additional DBMS instance for the corresponding ERPsystem. Otherwise, the steps to install the operating system and thebase database management system software are performed as well by theSystem Management Flow.

The Resource Topology of both orders 340, 350 contains its own resourcesfor OSContainer 345, 355, OS 347, 357, and DBMS Software 348, 358, whichreflect only the operational aspects of the underlying IT ServiceEnvironment (e.g. installing the operating system and DBMS software) andthe resource instance specific properties (e.g. for DBMS credential andlicense data). The OSContainer 365, OS 367, and DBMS Software SharedResources 368 represent the real resources shared between both orders340, 350. Resources 365, 367, 368 are referenced from both resourcetopologies of the two orders 340, 350. That is, processes specific toorder 340 reference and are concerned with resources 345-348 andresources 365-368. Similarly, processes of order 350 reference resources355-358 and resources 365-368. In one embodiment, all operationsdelegated to the shared resources 365-368. In another embodiment,operations are mainly performed by the resources 345-348 and 355-358,respectively. In this embodiment, the shared resources are mainly usedfor synchronization purpose and for storing state information of theunderlying real IT resources. Synchronization overhead is handled by SFC320.

The diagrams in FIGS. 2-3 illustrate the architecture, functionality,and operation of possible implementations of systems, methods, andcomputer program products according to various embodiments of thepresent invention. In this regard, each block in the flowchart or blockdiagrams may represent a module, segment, or portion of code, whichcomprises one or more executable instructions for implementing thespecified logical function(s). It should also be noted that, in somealternative implementations, the functions noted in the block may occurout of the order noted in the figures. For example, two blocks shown insuccession may, in fact, be executed substantially concurrently, or theblocks may sometimes be executed in the reverse order, depending uponthe functionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts, or combinations of special purpose hardware andcomputer instructions.

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting of the invention. Asused herein, the singular forms “a,” “an,” and “the” are intended toinclude the plural forms as well, unless the context clearly indicatesotherwise. It will be further understood that the terms “comprises”and/or “comprising,” when used in this specification, specify thepresence of stated features, integers, steps, operations, elements,and/or components, but do not preclude the presence or addition of oneor more other features, integers, steps, operations, elements,components, and/or groups thereof.

The corresponding structures, materials, acts, and equivalents of allmeans or step plus function elements in the claims below are intended toinclude any structure, material, or act for performing the function incombination with other claimed elements as specifically claimed. Thedescription of the present invention has been presented for purposes ofillustration and description, but is not intended to be exhaustive orlimited to the invention in the form disclosed. Many modifications andvariations will be apparent to those of ordinary skill in the artwithout departing from the scope and spirit of the invention. Theembodiment was chosen and described in order to best explain theprinciples of the invention and the practical application, and to enableothers of ordinary skill in the art to understand the invention forvarious embodiments with various modifications as are suited to theparticular use contemplated.

What is claimed is:
 1. An order processing system comprising: one ormore processors; one or more non-transitory computer-readable storagedevices; program instructions, which are stored on the one or morenon-transitory storage devices for execution by the one or moreprocessors causing the one or more processors to carry out operationsdefined by the program instructions; an order processing containercomprising at least a subset of the program instructions that, uponbeing executed by the one or more processors, drives order processingactions for a plurality of discrete orders, wherein the order processingcontainer sequentially passes each of the discrete orders over a networkto a plurality of different resources, wherein the order processingcontainer maintains an internal stack for sequentially traversing thedifferent resources while abstracting specifics of the differentresources being utilized to process the discrete orders, wherein each ofthe plurality of discrete orders is a document that comprises an ordername, an order type, a flow section, and an order information section,wherein the flow section defines a flow of a sequence of unique tasks tobe conducted in a sequential task order defined by the flow section,wherein the sequence of tasks of the flow is to be performed by thedifferent resources to which the respective discrete order is passed,wherein each of the discrete orders maintains state for the flow definedwithin the document of the respective discrete order, wherein the orderinformation section includes input and topology parameters that describecomputing resources and relationships to be created, deleted, andutilized when processing tasks of the flow defined by the respectivediscrete order, wherein the topology parameters comprise asynchronization scope value; and a synchronization function componentcomprising at least a subset of the program instructions that upon beingexecuted by the one or more processors permits transparent usage ofshared ones of the different resources in accordance with shared usageresource topology parameters specified within a subset of the discreteorders involved in usage of the shared ones of the different resourcesat any point in time, wherein the synchronization function componentsupports concurrent processing of the subset of the discrete orders andsupports a guarantee of non-concurrently processing of the subset of thediscrete orders, depending on values stored within the synchronizationscope value of respective ones of the subset of the discrete orders. 2.The order processing system of claim 1, wherein the synchronizationfunction component is configured to support standardized resourcetopology actions related to the shared ones of the different resources,wherein said standardized resource topology actions comprise abindOrcreate action and an unbindOrdelete action, wherein thebindOrcreate action is a programmatic action that defines a connectionof a flow-specific resource identifier of a related flow stored within acorresponding one of the discrete orders with one of the shared ones ofthe different resources to which the bindOrcreate action applies,wherein the unbindOrdelete action is a programmatic action thatdisconnects a flow specific resource identifier of a related flow storedwithin a corresponding one of the discrete orders with one of the sharedones of the different resources.
 3. The order processing system of claim1, wherein the synchronization scope value of each of the discreteorders consists of All, BindAndUnbind, or None.
 4. The order processingsystem of claim 1, further comprising: a factory registry comprising atleast a subset of the program instructions that upon being executed bythe one or more processors supports a creation and deletion of resourceinstances of the different resources as defined by the topologyparameters of the order information section of respective ones of thediscrete orders.
 5. The order processing system of claim 1, furthercomprising: a relationship registry comprising at least a subset of theprogram instructions that upon being executed by the one or moreprocessors maintains relationships among resource instances of thedifferent resources as defined by the topology parameters of the orderinformation section of respective ones of the discrete orders.
 6. Theorder processing system of claim 1, wherein the synchronization functioncomponent enables the order processing system to perform thesynchronization function without requiring explicit synchronizationhandling to be defined in code of the flow of the subset of discreteorders.
 7. The order processing system of claim 1, wherein for each ofthe discrete orders, the flow utilizes a set of Web service interfacesto import and export functionality for the sequence of unique tasks. 8.The order processing system of claim 1, wherein one established valuefor the synchronization scope value ensures that one of the differentresources that modifies a resource topology of a potentially shared oneof the different resources is isolated from all other ones of thedifferent resources with regard to concurrently sharing of the differentresources per the synchronization function component.
 9. The orderprocessing system of claim 1, wherein the flow as defined within aportion of the different resources utilizes a set of Web interfacesdefined within the flow to import and export functionality for specificones of the unique tasks.
 10. The order processing system of claim 1,wherein the flow is defined within respective ones of the discreteorders using a Web services business process execution language(WS-BPEL).
 11. A system comprising: one or more processors; one or morenon-transitory computer-readable storage devices; program instructions,which are stored on at least one of the one or more non-transitorycomputer-readable storage devices for execution by at least one of theone or more processors; an order processing container, comprising aportion of the program instructions, configured to be a central enginethat programmatically drives order processing actions for a plurality ofdiscrete orders, wherein the order processing container sequentiallypasses each of the discrete orders over a network to a plurality ofdifferent resources, wherein the order processing container maintains aninternal stack for sequentially traversing the different resources whileabstracting specifics of the different resources being utilized toprocess the discrete orders, wherein each of the plurality of discreteorders is a document that comprises an order name, an order type, a flowsection, and an order information section, wherein the flow sectiondefines a flow of a sequence of unique tasks to be conducted in asequential task order defined by the flow section, wherein the sequenceof tasks of the flow is to be performed by the different resources towhich the respective discrete order is passed, wherein each of thediscrete orders maintains state for the flow defined within the documentof the respective discrete order, wherein the order information sectionincludes input and topology parameters that describe computing resourcesand relationships to be created, deleted, and utilized when processingtasks of the flow defined by the respective discrete order, wherein thetopology parameters comprise a synchronization scope value; and asynchronization function component, comprising a portion of the programinstructions, that supports concurrent processing of a subset of thediscrete orders and supports a guarantee of non-concurrently processingof the subset of the discrete orders, depending on values stored withinthe synchronization scope value of respective ones of the subset of thediscrete orders.
 12. The system of claim 11, wherein each of thediscrete orders is one of three types of orders consisting of an initialorder type, a modification order type, and a termination order type,wherein initial ones of the discrete orders having the initial ordertype contain tasks for building up an initial resource topology, whereinmodification ones of the discrete orders having the modification ordertype are processed on resource topologies that have been initialized byone of the initial orders and result in a change to a respective one ofthe resource topologies, and wherein termination ones of the discreteorders having the termination order type terminate all managementactions relating to defined resource topology.
 13. The system of claim11, further comprising: a factory registry, comprising a portion of theprogram instructions, configured to support a creation and deletion ofresource instances in a resource topology defined by at least one of thediscrete orders.
 14. The system of claim 11, further comprising: arelationship registry, comprising a portion of the program instructions,configured to maintain relationships among resource instances ofresource topologies defined by at least one of the discrete orders. 15.The system of claim 11, wherein for each of the discrete orders, theflow utilizes a set of Web service interfaces to import and exportfunctionality for the sequence of unique tasks.
 16. The system of claim11, wherein one established value for the synchronization scope valueensures that one of the different resources that modifies a resourcetopology of a potentially shared one of the different resources isisolated from all other ones of the different resources with regard toconcurrently sharing of the different resources per the synchronizationfunction component.
 17. The system of claim 11, wherein thesynchronization function component is configured to support standardizedresource topology actions related to shared resources, wherein saidstandardized resource topology actions comprise a bindOrcreate actionand an unbindOrdelete action, wherein the bindOrcreate action is aprogrammatic action that defines a connection of a flow-specificresource identifier of a related flow stored within a corresponding oneof the discrete orders with a shared one of the different resources towhich the bindOrcreate action applies, wherein the unbindOrdelete actionis a programmatic action that disconnects a flow-specific resourceidentifier of a related flow stored within a corresponding one of thediscrete orders with the shared one of the different resources.
 18. Thesystem of claim 11, wherein the flow of the discrete orders is definedwithin respective ones of the discrete orders using a Web servicesbusiness process execution language (WS-BPEL).
 19. The system of claim11, wherein the flow is written in the document of corresponding ones ofthe discrete orders in one of a Business Process Modeling Notation(BPMN), a Web Services Conversation Language (WS-CDL), XML ProcessDefinition Language, a Service-Oriented Modeling Framework (SOMF)language, and a Web Services Flow Language (WSFL).